Optimal FCFS allocation rules for periodic‐review assemble‐to‐order systems

In Assemble‐To‐Order (ATO) systems, situations may arise in which customer demand must be backlogged due to a shortage of some components, leaving available stock of other components unused. Such unused component stock is called remnant stock. Remnant stock is a consequence of both component ordering decisions and decisions regarding allocation of components to end‐product demand. In this article, we examine periodic‐review ATO systems under linear holding and backlogging costs with a component installation stock policy and a First‐Come‐First‐Served (FCFS) allocation policy. We show that the FCFS allocation policy decouples the problem of optimal component allocation over time into deterministic period‐by‐period optimal component allocation problems. We denote the optimal allocation of components to end‐product demand as multimatching. We solve the multi‐matching problem by an iterative algorithm. In addition, an approximation scheme for the joint replenishment and allocation optimization problem with both upper and lower bounds is proposed. Numerical experiments for base‐stock component replenishment policies show that under optimal base‐stock policies and optimal allocation, remnant stock holding costs must be taken into account. Finally, joint optimization incorporating optimal FCFS component allocation is valuable because it provides a benchmark against which heuristic methods can be compared. © 2015 Wiley Periodicals, Inc. Naval Research Logistics 62: 158–169, 2015     

双壳体潜艇磁场变化的实验研究与特性分析

双壳体潜艇的磁化特征与单壳体潜艇有较大区别,为了将其磁化特性分析清楚,建立了双层圆柱形铁壳桶的简易潜艇模型,并将其放置于地球磁场环境中,利用通电线圈产生的强大磁场对潜艇模型进行局部磁化;然后,以潜艇垂向磁场变化量作为分析对象,并结合舰船磁场规律、磁滞特性、退磁场等理论,对双壳体潜艇的磁场变化规律进行了定性分析。研究结果表明:双壳体潜艇的外壳磁化规律近似于单壳体潜艇,而由于外壳屏蔽地球磁场,内壳几乎只受到线圈磁化影响。该结论可以为舰船消磁作业等提供理论依据。     

一类具有时滞和捕获的食物链模型的周期解

研究一类具有时滞和捕获的食物链模型,借助重合度理论中的Mawhin延拓引理,得到了保证系统至少存在8个正周期解的充分条件。     

64mm催泪弹的空中运动特性研究

建立64mm催泪弹外弹道数学模型,分析64mm催泪弹的空中运动状态,找出影响64mm催泪弹飞行稳定性的主要因素,给出64mm催泪弹的改进方向和技术措施,以提高催泪弹的可靠性和作用有效性,并指导现装备的催泪弹的改进和新型催泪弹的设计。     

具有脉冲和Holling IV类功能反应的三维捕食系统

建立了在固定时刻具有脉冲效应的三维捕食系统,利用常微分方程比较原理、含脉冲的比较原理及Lyapunov函数方法,得到了该系统的持续生存性、周期解的存在唯一性和全局吸引性,并给出了保持这些性质时脉冲项应满足的界限.     

Riccati传递矩阵法在潜艇结构强度和稳定性分析中的应用

运用Riccati传递矩阵方法,建立了旋转壳单元的场传递矩阵,推导了肋骨和母线倾角不连续位置的点传递矩阵,在推导中考虑了肋骨各方向可能的变形,编制了用于分析组合加肋旋转壳应力和稳定性的计算机程序(应力程序SAPRi,稳定性程序BAPRi)。利用SAPRi程序和BAPRi程序对潜艇耐压结构的典型结构算例进行了应力和稳定性分析,并将计算结果与理论结果或商用软件(MSC/NASTRAN)的计算结果进行比较,表明该程序结果正确可信,计算速度快,适合于工程应用。     

周期生存的血红细胞模型的周期解

本文研究了如下周期生存的带有反馈控制的有时滞血红细胞模型dx(dtt)=-b(t)x(t)+β(t)e-x(t-τ(t))+c(t)u(t-δ(t)),dud(tt)=-η(t)u(t)+α(t)x(t-σ(t))的周期解的存在性,给出了正周期解存在的充分条件。     

高炮射弹飞行时间拟合

用插值拟合和最小二乘逼近拟合方法对高炮射弹飞行时间拟合问题进行了研究.通过对插值拟合公式原理及误差规律的分析,提出确定可用区间的"去值检验"方法,说明了插值拟合公式的应用范围.通过对最小二乘拟合公式实际计算结果的分析,得出了"拟合公式阶数取3为最佳"的结论.对其他口径高炮的射弹飞行时间拟合也基本适用.     

试论价层轨道的杂化——兼论杂化轨道理论与价层电子对互斥理论的统一

在分子结构理论中,杂化轨道理论在多原子分子的空间构型被实验确定后,能够根据一定的假设给出合理的解释;价层电子对互斥理论主要用于预测分子或离子的空间构型,但其假设有些生硬、推理不够严密,对VP与电子对空间构型之间关系的推导比较繁琐,不易理解,也不能很好地解释一些多原子分子(如PF5、IF7等分子)中存在键长不等的现象。两种理论在各自的领域都取得了很大的成功,也各有其不足之处,一直未能统一。价层轨道杂化理论正是在综合了这两种理论的优点之后得到的。该理论在假设较少———即假设中心原子的价层轨道在成键时都要发生杂化,该假设与实验事实完全相符———的前提下,利用立体几何学原理对多原子分子的空间构型进行了非常简洁的推导,其结果不仅可全部继承前两种理论的成功之处,而且还能解释多原子分子中出现的键长不同、存在异构体等现象,这是其独到之处,也是其创新之处。     

Selecting review periods for a coordinated multi‐item inventory model with staggered deliveries

Consider an N‐item, periodic review, infinite‐horizon, undiscounted, inventory model with stochastic demands, proportional holding and shortage costs, and full backlogging. For 1 ≤ j ≤ N, orders for item j can arrive in every period, and the cost of receiving them is negligible (as in a JIT setting). Every T_j periods, one reviews the current stock level of item j and decides on deliveries for each of the next T_j periods, thus incurring an item‐by‐item fixed cost k_j. There is also a joint fixed cost whenever any item is reviewed. The problem is to find review periods T₁, T₂, …, T_N and an ordering policy satisfying the average cost criterion. The current article builds on earlier results for the single‐item case. We prove an optimal policy exists, give conditions where it has a simple form, and develop a branch and bound algorithm for its computation. We also provide two heuristic policies with O(N) computational requirements. Computational experiments indicate that the branch and bound algorithm can handle normal demand problems with N ≤ 10 and that both heuristics do well for a wide variety of problems with N ranging from 2 to 200; moreover, the performance of our heuristics seems insensitive to N. © 2001 John Wiley & Sons, Inc. Naval Research Logistics 48:430–449, 2001